Streaming algorithms

Results: 115



#Item
31 Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) =

 Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) =

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-19 07:51:43
32 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-22 08:15:45
33Wireless Pers Commun:565–591 DOIs11277Cross-Layer QoS Scheduling for Layered Multicast Streaming in OFDMA Wireless Networks Yuedong Xu · Xiaoxin Wu · John C. S. Lui

Wireless Pers Commun:565–591 DOIs11277Cross-Layer QoS Scheduling for Layered Multicast Streaming in OFDMA Wireless Networks Yuedong Xu · Xiaoxin Wu · John C. S. Lui

Add to Reading List

Source URL: www.cs.cuhk.hk

Language: English - Date: 2009-10-17 02:24:59
34 Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of

 Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-19 07:51:43
35 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

 Exercise 1 (Streaming algorithm for frequent items). We want to design a streaming algorithm that nds all the items in a stream of n items with frequency strictly greater than n/k for some xed k . Consider the followin

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2015-01-22 08:15:45
36Network data streaming: a computer scientist’s journey in signal processing Jun (Jim) Xu Networking and Telecommunications Group College of Computing

Network data streaming: a computer scientist’s journey in signal processing Jun (Jim) Xu Networking and Telecommunications Group College of Computing

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2007-07-08 13:36:51
37CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Almost Online Square Packing Shahin Kamali Abstract

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Almost Online Square Packing Shahin Kamali Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-06-21 01:14:48
38CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Core-Preserving Algorithms Hamid Zarrabi-Zadeh∗ Abstract

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Core-Preserving Algorithms Hamid Zarrabi-Zadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:09:14
39Resource Allocation Algorithms for Multi-Class Wireless Networks Bracha M. Epstein Submitted in partial fulllment of the requirements for the degree of

Resource Allocation Algorithms for Multi-Class Wireless Networks Bracha M. Epstein Submitted in partial fulllment of the requirements for the degree of

Add to Reading List

Source URL: www.sigmobile.org

Language: English - Date: 2013-08-14 12:38:09
40CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract

CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:59:03